Efficient multi-bit shifting algorithm in multiplicative inversion problemsJANG, Injoo; HYEONG SEON YOO.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-25860-4, 4Vol, part II,102-110Conference Paper

Optimal use of montgomery multiplication on smart cardsBOSCHER, Arnaud; NACIRI, Robert.Lecture notes in computer science. 2006, pp 252-262, issn 0302-9743, isbn 3-540-33311-8, 1Vol, 11 p.Conference Paper

Fpga montgomery multiplier architectures : A comparsonMCLVOR, Ciaran; MCLOONE, Maire; MCCANNY, John V et al.Annual IEEE symposium on field-programmable custom computing machines. 2004, pp 279-282, isbn 0-7695-2230-0, 1Vol, 4 p.Conference Paper

Representation of elements in F₂m enabling unified field arithmetic for elliptic curve cryptographyCILARDO, A; MAZZEO, A; MAZZOCCA, N et al.Electronics Letters. 2005, Vol 41, Num 14, pp 798-800, issn 0013-5194, 3 p.Article

Exact analysis of Montgomery multiplicationSATO, Hisayoshi; SCHEPERS, Daniel; TAKAGI, Tsuyoshi et al.Lecture notes in computer science. 2004, pp 290-304, issn 0302-9743, isbn 3-540-24130-2, 15 p.Conference Paper

Efficient unified Montgomery inversion with multibit shiftingSAVAS, E; NASEER, M; GUTUB, A. A.-A et al.IEE proceedings. Computers and digital techniques. 2005, Vol 152, Num 4, pp 489-498, issn 1350-2387, 10 p.Article

The Modeling of Harmonious Color Combinations for Improved Usability and UXSTICKEL, Christian; MAIER, Karin; EBNER, Martin et al.Information technology interfaces. 2009, pp 323-328, isbn 978-953-7138-15-8, 1Vol, 6 p.Conference Paper

Logging home use of the internet in the Blacksburg Electronic VillageCARROLL, John M; SNOOK, Jason S; ISENHOUR, Philip L et al.International journal of advanced media and communication. 2009, Vol 3, Num 3, pp 333-348, issn 1462-4613, 16 p.Article

Bipartite modular multiplicationKAIHARA, Marcelo E; TAKAGI, Naofumi.Lecture notes in computer science. 2005, pp 201-210, issn 0302-9743, isbn 3-540-28474-5, 10 p.Conference Paper

High-speed RSA crypto-processor with radix-4 modular multiplication and Chinese remainder theoremKOO, Bonseok; LEE, Dongwook; RYU, Gwonho et al.Lecture notes in computer science. 2006, pp 81-93, issn 0302-9743, isbn 3-540-49112-0, 1Vol, 13 p.Conference Paper

Power analysis to ECC using differential power between multiplication and squaringAKISHITA, Toru; TAKAGI, Tsuyoshi.Lecture notes in computer science. 2006, pp 151-164, issn 0302-9743, isbn 3-540-33311-8, 1Vol, 14 p.Conference Paper

Relative doubling attack against montgomery ladderYEN, Sing-Ming; KO, Lee-Chun; MOON, Sangjae et al.Lecture notes in computer science. 2006, pp 117-128, issn 0302-9743, isbn 3-540-33354-1, 1Vol, 12 p.Conference Paper

Optimizing robustness while generating shared secret safe primesONG, Emil; KUBIATOWICZ, John.Lecture notes in computer science. 2005, pp 120-137, issn 0302-9743, isbn 3-540-24454-9, 18 p.Conference Paper

Parallel montgomery multipliersSANU, Moboluwaji O; SWARTZLANDER, Earl E; CHASE, Craig M et al.IEEE International Conference on Application-Specific Systems, Architectures, and Processors. 2004, pp 63-72, isbn 0-7695-2226-2, 1Vol, 10 p.Conference Paper

Montgomery multiplication over ringsBRENNAN, Joseph P; KATTI, Rajendra.Journal of the Franklin Institute. 2009, Vol 346, Num 1, pp 10-16, issn 0016-0032, 7 p.Article

Application of Montgomery's trick to scalar multiplication for elliptic and hyperelliptic curves using a fixed base pointPRADEEP KUMAR MISHRA; SARKAR, Palash.Lecture notes in computer science. 2004, pp 41-54, issn 0302-9743, isbn 3-540-21018-0, 14 p.Conference Paper

Implementation of the extended euclidean algorithm for the Tate pairing on FPGAITO, Takehiro; SHIBATA, Yuichiro; OGURI, Kiyoshi et al.Lecture notes in computer science. 2004, pp 911-916, issn 0302-9743, isbn 3-540-22989-2, 6 p.Conference Paper

Energy-efficient software implementation of long integer modular arithmeticGROSSSCHÄDL, Johann; AVANZI, Roberto M; SAVAS, Erkay et al.Lecture notes in computer science. 2005, pp 75-90, issn 0302-9743, isbn 3-540-28474-5, 16 p.Conference Paper

An efficient hardware architecture of a scalable elliptic curve crypto-processor over GF(2ⁿ)TAWALBEH, Loai; TENCA, Alexandre; PARK, Song et al.Proceedings of SPIE, the International Society for Optical Engineering. 2005, pp 59100Q.1-59100Q.11, issn 0277-786X, isbn 0-8194-5915-1, 1VolConference Paper

Montgomery multiplication on FPGA with modified carry-save encodingBUCEK, J; LORENCZ, R.International conference on signals and electronic systems. 2005, pp 313-315, isbn 83-906074-7-6, 1Vol, 3 p.Conference Paper

Montgomery scalar multiplication for genus 2 curvesDUQUESNE, Sylvain.Lecture notes in computer science. 2004, pp 153-168, issn 0302-9743, isbn 3-540-22156-5, 16 p.Conference Paper

Long modular multiplication for cryptographic applicationsHARS, Laszlo.Lecture notes in computer science. 2004, pp 45-61, issn 0302-9743, isbn 3-540-22666-4, 17 p.Conference Paper

Low Latency Systolic Montgomery Multiplier for Finite Field GF(2^m) Based on PentanomialsJIAFENG XIE; JIAN JUN HE; KUMAR MEHER, Pramod et al.IEEE transactions on very large scale integration (VLSI) systems. 2013, Vol 21, Num 2, pp 385-389, issn 1063-8210, 5 p.Article

On the generalisation of special moduli for faster interleaved montgomery modular multiplicationAKLEYLEK, Sedat; CENK, Murat; ÖZBUDAK, Ferruh et al.IET information security (Print). 2013, Vol 7, Num 3, pp 165-171, issn 1751-8709, 7 p.Article

Simple power analysis on fast modular reduction with NIST recommended elliptic curvesSAKAI, Yasuyuki; SAKURAI, Kouichi.Lecture notes in computer science. 2005, pp 169-180, issn 0302-9743, isbn 3-540-30934-9, 12 p.Conference Paper